package hardBD;
import java.util.Arrays;


public class FastFourierTransformation {
	private int sampleSize, halfSample;	
	private double[] cosine, sine;
	
	public FastFourierTransformation(int sampleSize){
		halfSample = sampleSize / 2;
		sine = new double[halfSample];
		cosine = new double[halfSample];
		for(int i = 0; i < sine.length; i++){
			sine[i] = Math.sin(-2 * Math.PI * i / sampleSize);
			cosine[i] = Math.cos(-2 * Math.PI * i / sampleSize);
		}
	}
	
	public void transform(double[] toTransform){
		double[] zeroes = new double[toTransform.length];
		Arrays.fill(zeroes, 0);
		for(int i = 1; i < sampleSize - 1; i++){
			toTransform[i] = (double)Integer.reverse((int)toTransform[i]);
		}
	}
}
